Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Model Generation in Disjunctive Normal Databases Model Generation in Disjunctive Normal Databases

Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Problem Solving with Model-generation Approaches Based on Puhr Tableaux in Proc. Problem-solving Methodologies with Automated Deduction, Workshop at Cade '98

Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen a Connuence Test for Concurrent Constraint Programs a Connuence Test for Concurrent Constraint Programs

We address the problem of identifying connuent parts of concurrent constraint programs. The connuence property guarantees that a concurrent program will always compute the same result independent of the execution strategy. In this paper, we introduce a simple test for connuence based on work in rewrite systems. Furthermore, we show how to use this test to certify the combination of concurrent c...

Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Minimal Model Generation with Positive Unit Hyper-resolution Tableaux Minimal Model Generation with Positive Unit Hyper-resolution Tableaux

Herbrand models for clausal theories are useful in several areas of computer science. In most cases, however, the conventional model generation algorithms are inappropriate because they generate non-minimal Herbrand models and can be ineecient. This article describes a novel approach for generating minimal Herbrand models of clausal theories. The approach builds upon positive unit hyper-resolut...

Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Positive Unit Hyper-resolution Tableaux for Minimal Model Generation Positive Unit Hyper-resolution Tableaux for Minimal Model Generation

Minimal Herbrand models for clausal theories are useful in several areas of computer science, e.g. automated theorem proving, program veriication, logic programming, databases, and artiicial intelligence. In most cases, the conventional model generation algorithms are inappropriate because they generate nonminimal Herbrand models and can be ineecient. This article describes a novel approach for...

Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen University Timetabling Using Constraint Handling Rules University Timetabling Using Constraint Handling Rules

Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied, soft constraints however may be violated, but should be satisfied as much as possible. This paper shows how to model our timetabling problem as a partial constraint satisfaction problem and gi...